Limited Recourse in Two-Stage Stochastic Linear Programs

نویسندگان

  • Patrizia Beraldi
  • Roberto Musmanno
  • Chefi Triki
  • Stavros A. Zenios
چکیده

Abstract In several real-world applications, modelled by two-stage stochastic problems, first and second-stage decisions (or some of their components) represent identical variables of the problem that is modelled. In these cases an appropriate solution of the problem might require that the second-stage decisions do not differ substantially from the corresponding first-stage ones. In this paper we propose a parametric approach to control the variability of the first and second-stage decisions and present a suitable solution framework. The advantage of the new approach is illustrated by considering two specific applications in electric power management and financial planning.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Glivenko-Cantelli problem in stochastic programming: Mixed-integer linear recourse

Expected recourse functions in linear two-stage stochastic programs with mixed-integer second stage are approximated by estimating the underlying probability distribution via empirical measures. Under mild conditions, almost sure uniform convergence of the empirical means to the original expected recourse function is established.

متن کامل

Two-Stage Stochastic Semidefinite Programming and Decomposition Based Interior Point Methods: Theory

We introduce two-stage stochastic semidefinite programs with recourse and present a Benders decomposition based linearly convergent interior point algorithms to solve them. This extends the results in Zhao [16] wherein it was shown that the logarithmic barrier associated with the recourse function of two-stage stochastic linear programs with recourse behaves as a strongly self-concordant barrie...

متن کامل

Decomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs with Recourse

Zhao [28] recently showed that the log barrier associated with the recourse function of twostage stochastic linear programs behaves as a strongly self-concordant barrier and forms a self concordant family on the first stage solutions. In this paper we show that the recourse function is also strongly self-concordant and forms a self concordant family for the two-stage stochastic convex quadratic...

متن کامل

An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse

We study an adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse. A partition-based formulation is a relaxation of the original stochastic program, and we study a finitely converging algorithm in which the partition is adaptively adjusted until it yields an optimal solution. A solution guided refinement strategy is developed to refine the partition by ...

متن کامل

A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse

We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a monolithic model, we show that one can iteratively solve a collection of smaller sub-problems and arrive at a solution to the entire problem. In this approach, decision variables corresponding to the initial stage and linear reco...

متن کامل

On complexity of stochastic programming problems

The main focus of this paper is in a discussion of complexity of stochastic programming problems. We argue that two-stage (linear) stochastic programming problems with recourse can be solved with a reasonable accuracy by using Monte Carlo sampling techniques, while multi-stage stochastic programs, in general, are intractable. We also discuss complexity of chance constrained problems and multi-s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000